TSTP Solution File: SEV446^1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : SEV446^1 : TPTP v8.1.2. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n023.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 09:45:13 EDT 2024
% Result : Theorem 0.16s 0.39s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 19
% Syntax : Number of formulae : 56 ( 19 unt; 14 typ; 0 def)
% Number of atoms : 433 ( 72 equ; 0 cnn)
% Maximal formula atoms : 5 ( 10 avg)
% Number of connectives : 52 ( 21 ~; 30 |; 0 &; 0 @)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 41 ( 40 >; 1 *; 0 +; 0 <<)
% Number of symbols : 21 ( 18 usr; 4 con; 0-6 aty)
% Number of variables : 88 ( 0 ^ 73 !; 6 ?; 88 :)
% ( 9 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
sTfun: ( $tType * $tType ) > $tType ).
thf(type_def_6,type,
sK0: $tType ).
thf(func_def_0,type,
'const/sets/INSERT':
!>[X0: $tType] : ( X0 > ( X0 > $o ) > X0 > $o ) ).
thf(func_def_1,type,
'const/sets/IN':
!>[X0: $tType] : ( X0 > ( X0 > $o ) > $o ) ).
thf(func_def_2,type,
'const/sets/EMPTY':
!>[X0: $tType] : ( X0 > $o ) ).
thf(func_def_6,type,
vEQ:
!>[X0: $tType] : ( X0 > X0 > $o ) ).
thf(func_def_7,type,
vOR: $o > $o > $o ).
thf(func_def_8,type,
sK1: sK0 ).
thf(func_def_9,type,
sK2: sK0 ).
thf(func_def_10,type,
kCOMB:
!>[X0: $tType,X1: $tType] : ( X0 > X1 > X0 ) ).
thf(func_def_11,type,
bCOMB:
!>[X0: $tType,X1: $tType,X2: $tType] : ( ( X1 > X2 ) > ( X0 > X1 ) > X0 > X2 ) ).
thf(func_def_12,type,
vAND: $o > $o > $o ).
thf(func_def_13,type,
vIMP: $o > $o > $o ).
thf(func_def_14,type,
vNOT: $o > $o ).
thf(f95,plain,
$false,
inference(equality_resolution,[],[f94]) ).
thf(f94,plain,
! [X0: sK0 > $o] : ( vAPP(sTfun(sK0,$o),sTfun(sK0,$o),vAPP(sK0,sTfun(sTfun(sK0,$o),sTfun(sK0,$o)),'const/sets/INSERT'(sK0),sK1),'const/sets/EMPTY'(sK0)) != vAPP(sTfun(sK0,$o),sTfun(sK0,$o),vAPP(sK0,sTfun(sTfun(sK0,$o),sTfun(sK0,$o)),'const/sets/INSERT'(sK0),sK1),X0) ),
inference(trivial_inequality_removal,[],[f89]) ).
thf(f89,plain,
! [X0: sK0 > $o] :
( ( $true = $false )
| ( vAPP(sTfun(sK0,$o),sTfun(sK0,$o),vAPP(sK0,sTfun(sTfun(sK0,$o),sTfun(sK0,$o)),'const/sets/INSERT'(sK0),sK1),'const/sets/EMPTY'(sK0)) != vAPP(sTfun(sK0,$o),sTfun(sK0,$o),vAPP(sK0,sTfun(sTfun(sK0,$o),sTfun(sK0,$o)),'const/sets/INSERT'(sK0),sK1),X0) ) ),
inference(constrained_superposition,[],[f88,f68]) ).
thf(f68,plain,
! [X0: $tType,X2: X0 > $o,X1: X0] : ( $true = vAPP(sTfun(X0,$o),$o,vAPP(X0,sTfun(sTfun(X0,$o),$o),'const/sets/IN'(X0),X1),vAPP(sTfun(X0,$o),sTfun(X0,$o),vAPP(X0,sTfun(sTfun(X0,$o),sTfun(X0,$o)),'const/sets/INSERT'(X0),X1),X2)) ),
inference(equality_resolution,[],[f25]) ).
thf(f25,plain,
! [X0: $tType,X2: X0,X3: X0 > $o,X1: X0] :
( ( X1 != X2 )
| ( vAPP(sTfun(X0,$o),$o,vAPP(X0,sTfun(sTfun(X0,$o),$o),'const/sets/IN'(X0),X1),vAPP(sTfun(X0,$o),sTfun(X0,$o),vAPP(X0,sTfun(sTfun(X0,$o),sTfun(X0,$o)),'const/sets/INSERT'(X0),X2),X3)) = $true ) ),
inference(equality_proxy_clausification,[],[f24]) ).
thf(f24,plain,
! [X0: $tType,X2: X0,X3: X0 > $o,X1: X0] :
( ( vAPP(sTfun(X0,$o),$o,vAPP(X0,sTfun(sTfun(X0,$o),$o),'const/sets/IN'(X0),X1),vAPP(sTfun(X0,$o),sTfun(X0,$o),vAPP(X0,sTfun(sTfun(X0,$o),sTfun(X0,$o)),'const/sets/INSERT'(X0),X2),X3)) = $true )
| ( $false = vAPP(X0,$o,vAPP(X0,sTfun(X0,$o),vEQ(X0),X1),X2) ) ),
inference(binary_proxy_clausification,[],[f19]) ).
thf(f19,plain,
! [X0: $tType,X2: X0,X3: X0 > $o,X1: X0] :
( ( vAPP(sTfun(X0,$o),$o,vAPP(X0,sTfun(sTfun(X0,$o),$o),'const/sets/IN'(X0),X1),vAPP(sTfun(X0,$o),sTfun(X0,$o),vAPP(X0,sTfun(sTfun(X0,$o),sTfun(X0,$o)),'const/sets/INSERT'(X0),X2),X3)) = $true )
| ( $false = vAPP($o,$o,vAPP($o,sTfun($o,$o),vOR,vAPP(X0,$o,vAPP(X0,sTfun(X0,$o),vEQ(X0),X1),X2)),vAPP(sTfun(X0,$o),$o,vAPP(X0,sTfun(sTfun(X0,$o),$o),'const/sets/IN'(X0),X1),X3)) ) ),
inference(binary_proxy_clausification,[],[f18]) ).
thf(f18,plain,
! [X0: $tType,X2: X0,X3: X0 > $o,X1: X0] : ( vAPP(sTfun(X0,$o),$o,vAPP(X0,sTfun(sTfun(X0,$o),$o),'const/sets/IN'(X0),X1),vAPP(sTfun(X0,$o),sTfun(X0,$o),vAPP(X0,sTfun(sTfun(X0,$o),sTfun(X0,$o)),'const/sets/INSERT'(X0),X2),X3)) = vAPP($o,$o,vAPP($o,sTfun($o,$o),vOR,vAPP(X0,$o,vAPP(X0,sTfun(X0,$o),vEQ(X0),X1),X2)),vAPP(sTfun(X0,$o),$o,vAPP(X0,sTfun(sTfun(X0,$o),$o),'const/sets/IN'(X0),X1),X3)) ),
inference(cnf_transformation,[],[f11]) ).
thf(f11,plain,
! [X0: $tType,X1: X0,X2: X0,X3: X0 > $o] : ( vAPP(sTfun(X0,$o),$o,vAPP(X0,sTfun(sTfun(X0,$o),$o),'const/sets/IN'(X0),X1),vAPP(sTfun(X0,$o),sTfun(X0,$o),vAPP(X0,sTfun(sTfun(X0,$o),sTfun(X0,$o)),'const/sets/INSERT'(X0),X2),X3)) = vAPP($o,$o,vAPP($o,sTfun($o,$o),vOR,vAPP(X0,$o,vAPP(X0,sTfun(X0,$o),vEQ(X0),X1),X2)),vAPP(sTfun(X0,$o),$o,vAPP(X0,sTfun(sTfun(X0,$o),$o),'const/sets/IN'(X0),X1),X3)) ),
inference(fool_elimination,[],[f10]) ).
thf(f10,plain,
! [X0: $tType,X1: X0,X2: X0,X3: X0 > $o] :
( ( vAPP(sTfun(X0,$o),$o,vAPP(X0,sTfun(sTfun(X0,$o),$o),'const/sets/IN'(X0),X1),vAPP(sTfun(X0,$o),sTfun(X0,$o),vAPP(X0,sTfun(sTfun(X0,$o),sTfun(X0,$o)),'const/sets/INSERT'(X0),X2),X3)) = vAPP(sTfun(X0,$o),$o,vAPP(X0,sTfun(sTfun(X0,$o),$o),'const/sets/IN'(X0),X1),X3) )
| ( X1 = X2 ) ),
inference(rectify,[],[f2]) ).
thf(f2,axiom,
! [X0: $tType,X1: X0,X2: X0,X3: X0 > $o] :
( ( vAPP(sTfun(X0,$o),$o,vAPP(X0,sTfun(sTfun(X0,$o),$o),'const/sets/IN'(X0),X1),vAPP(sTfun(X0,$o),sTfun(X0,$o),vAPP(X0,sTfun(sTfun(X0,$o),sTfun(X0,$o)),'const/sets/INSERT'(X0),X2),X3)) = vAPP(sTfun(X0,$o),$o,vAPP(X0,sTfun(sTfun(X0,$o),$o),'const/sets/IN'(X0),X1),X3) )
| ( X1 = X2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/sets/IN_INSERT_') ).
thf(f88,plain,
$false = vAPP(sTfun(sK0,$o),$o,vAPP(sK0,sTfun(sTfun(sK0,$o),$o),'const/sets/IN'(sK0),sK1),vAPP(sTfun(sK0,$o),sTfun(sK0,$o),vAPP(sK0,sTfun(sTfun(sK0,$o),sTfun(sK0,$o)),'const/sets/INSERT'(sK0),sK1),'const/sets/EMPTY'(sK0))),
inference(trivial_inequality_removal,[],[f87]) ).
thf(f87,plain,
( ( sK1 != sK1 )
| ( $false = vAPP(sTfun(sK0,$o),$o,vAPP(sK0,sTfun(sTfun(sK0,$o),$o),'const/sets/IN'(sK0),sK1),vAPP(sTfun(sK0,$o),sTfun(sK0,$o),vAPP(sK0,sTfun(sTfun(sK0,$o),sTfun(sK0,$o)),'const/sets/INSERT'(sK0),sK1),'const/sets/EMPTY'(sK0))) ) ),
inference(backward_demodulation,[],[f30,f86]) ).
thf(f86,plain,
sK1 = sK2,
inference(trivial_inequality_removal,[],[f85]) ).
thf(f85,plain,
( ( $true = $false )
| ( sK1 = sK2 ) ),
inference(forward_demodulation,[],[f84,f60]) ).
thf(f60,plain,
! [X0: $tType,X1: X0] : ( vAPP(sTfun(X0,$o),$o,vAPP(X0,sTfun(sTfun(X0,$o),$o),'const/sets/IN'(X0),X1),'const/sets/EMPTY'(X0)) = $false ),
inference(trivial_inequality_removal,[],[f59]) ).
thf(f59,plain,
! [X0: $tType,X1: X0] :
( ( $true != $true )
| ( vAPP(sTfun(X0,$o),$o,vAPP(X0,sTfun(sTfun(X0,$o),$o),'const/sets/IN'(X0),X1),'const/sets/EMPTY'(X0)) = $false ) ),
inference(superposition,[],[f17,f6]) ).
thf(f6,plain,
! [X0: $o] :
( ( $true = X0 )
| ( $false = X0 ) ),
introduced(fool_axiom,[]) ).
thf(f17,plain,
! [X0: $tType,X1: X0] : ( vAPP(sTfun(X0,$o),$o,vAPP(X0,sTfun(sTfun(X0,$o),$o),'const/sets/IN'(X0),X1),'const/sets/EMPTY'(X0)) != $true ),
inference(cnf_transformation,[],[f12]) ).
thf(f12,plain,
! [X0: $tType,X1: X0] : ( vAPP(sTfun(X0,$o),$o,vAPP(X0,sTfun(sTfun(X0,$o),$o),'const/sets/IN'(X0),X1),'const/sets/EMPTY'(X0)) != $true ),
inference(flattening,[],[f9]) ).
thf(f9,plain,
! [X0: $tType,X1: X0] : ( vAPP(sTfun(X0,$o),$o,vAPP(X0,sTfun(sTfun(X0,$o),$o),'const/sets/IN'(X0),X1),'const/sets/EMPTY'(X0)) != $true ),
inference(fool_elimination,[],[f8]) ).
thf(f8,plain,
! [X0: $tType,X1: X0] : ~ vAPP(sTfun(X0,$o),$o,vAPP(X0,sTfun(sTfun(X0,$o),$o),'const/sets/IN'(X0),X1),'const/sets/EMPTY'(X0)),
inference(rectify,[],[f1]) ).
thf(f1,axiom,
! [X0: $tType,X1: X0] : ~ vAPP(sTfun(X0,$o),$o,vAPP(X0,sTfun(sTfun(X0,$o),$o),'const/sets/IN'(X0),X1),'const/sets/EMPTY'(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/sets/NOT_IN_EMPTY_') ).
thf(f84,plain,
( ( sK1 = sK2 )
| ( $true = vAPP(sTfun(sK0,$o),$o,vAPP(sK0,sTfun(sTfun(sK0,$o),$o),'const/sets/IN'(sK0),sK1),'const/sets/EMPTY'(sK0)) ) ),
inference(duplicate_literal_removal,[],[f83]) ).
thf(f83,plain,
( ( sK1 = sK2 )
| ( sK1 = sK2 )
| ( $true = vAPP(sTfun(sK0,$o),$o,vAPP(sK0,sTfun(sTfun(sK0,$o),$o),'const/sets/IN'(sK0),sK1),'const/sets/EMPTY'(sK0)) ) ),
inference(equality_resolution,[],[f81]) ).
thf(f81,plain,
! [X0: sK0,X1: sK0 > $o] :
( ( vAPP(sTfun(sK0,$o),sTfun(sK0,$o),vAPP(sK0,sTfun(sTfun(sK0,$o),sTfun(sK0,$o)),'const/sets/INSERT'(sK0),sK2),'const/sets/EMPTY'(sK0)) != vAPP(sTfun(sK0,$o),sTfun(sK0,$o),vAPP(sK0,sTfun(sTfun(sK0,$o),sTfun(sK0,$o)),'const/sets/INSERT'(sK0),X0),X1) )
| ( sK1 = X0 )
| ( sK1 = sK2 )
| ( $true = vAPP(sTfun(sK0,$o),$o,vAPP(sK0,sTfun(sTfun(sK0,$o),$o),'const/sets/IN'(sK0),sK1),X1) ) ),
inference(trivial_inequality_removal,[],[f74]) ).
thf(f74,plain,
! [X0: sK0,X1: sK0 > $o] :
( ( $true = $false )
| ( $true = vAPP(sTfun(sK0,$o),$o,vAPP(sK0,sTfun(sTfun(sK0,$o),$o),'const/sets/IN'(sK0),sK1),X1) )
| ( sK1 = X0 )
| ( sK1 = sK2 )
| ( vAPP(sTfun(sK0,$o),sTfun(sK0,$o),vAPP(sK0,sTfun(sTfun(sK0,$o),sTfun(sK0,$o)),'const/sets/INSERT'(sK0),sK2),'const/sets/EMPTY'(sK0)) != vAPP(sTfun(sK0,$o),sTfun(sK0,$o),vAPP(sK0,sTfun(sTfun(sK0,$o),sTfun(sK0,$o)),'const/sets/INSERT'(sK0),X0),X1) ) ),
inference(constrained_superposition,[],[f22,f29]) ).
thf(f29,plain,
( ( $true = vAPP(sTfun(sK0,$o),$o,vAPP(sK0,sTfun(sTfun(sK0,$o),$o),'const/sets/IN'(sK0),sK1),vAPP(sTfun(sK0,$o),sTfun(sK0,$o),vAPP(sK0,sTfun(sTfun(sK0,$o),sTfun(sK0,$o)),'const/sets/INSERT'(sK0),sK2),'const/sets/EMPTY'(sK0))) )
| ( sK1 = sK2 ) ),
inference(equality_proxy_clausification,[],[f26]) ).
thf(f26,plain,
( ( $true = vAPP(sTfun(sK0,$o),$o,vAPP(sK0,sTfun(sTfun(sK0,$o),$o),'const/sets/IN'(sK0),sK1),vAPP(sTfun(sK0,$o),sTfun(sK0,$o),vAPP(sK0,sTfun(sTfun(sK0,$o),sTfun(sK0,$o)),'const/sets/INSERT'(sK0),sK2),'const/sets/EMPTY'(sK0))) )
| ( $true = vAPP(sK0,$o,vAPP(sK0,sTfun(sK0,$o),vEQ(sK0),sK1),sK2) ) ),
inference(binary_proxy_clausification,[],[f16]) ).
thf(f16,plain,
vAPP(sTfun(sK0,$o),$o,vAPP(sK0,sTfun(sTfun(sK0,$o),$o),'const/sets/IN'(sK0),sK1),vAPP(sTfun(sK0,$o),sTfun(sK0,$o),vAPP(sK0,sTfun(sTfun(sK0,$o),sTfun(sK0,$o)),'const/sets/INSERT'(sK0),sK2),'const/sets/EMPTY'(sK0))) != vAPP(sK0,$o,vAPP(sK0,sTfun(sK0,$o),vEQ(sK0),sK1),sK2),
inference(cnf_transformation,[],[f15]) ).
thf(f15,plain,
vAPP(sTfun(sK0,$o),$o,vAPP(sK0,sTfun(sTfun(sK0,$o),$o),'const/sets/IN'(sK0),sK1),vAPP(sTfun(sK0,$o),sTfun(sK0,$o),vAPP(sK0,sTfun(sTfun(sK0,$o),sTfun(sK0,$o)),'const/sets/INSERT'(sK0),sK2),'const/sets/EMPTY'(sK0))) != vAPP(sK0,$o,vAPP(sK0,sTfun(sK0,$o),vEQ(sK0),sK1),sK2),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f13,f14]) ).
thf(f14,plain,
( ? [X0: $tType,X1: X0,X2: X0] : ( vAPP(sTfun(X0,$o),$o,vAPP(X0,sTfun(sTfun(X0,$o),$o),'const/sets/IN'(X0),X1),vAPP(sTfun(X0,$o),sTfun(X0,$o),vAPP(X0,sTfun(sTfun(X0,$o),sTfun(X0,$o)),'const/sets/INSERT'(X0),X2),'const/sets/EMPTY'(X0))) != vAPP(X0,$o,vAPP(X0,sTfun(X0,$o),vEQ(X0),X1),X2) )
=> ( vAPP(sTfun(sK0,$o),$o,vAPP(sK0,sTfun(sTfun(sK0,$o),$o),'const/sets/IN'(sK0),sK1),vAPP(sTfun(sK0,$o),sTfun(sK0,$o),vAPP(sK0,sTfun(sTfun(sK0,$o),sTfun(sK0,$o)),'const/sets/INSERT'(sK0),sK2),'const/sets/EMPTY'(sK0))) != vAPP(sK0,$o,vAPP(sK0,sTfun(sK0,$o),vEQ(sK0),sK1),sK2) ) ),
introduced(choice_axiom,[]) ).
thf(f13,plain,
? [X0: $tType,X1: X0,X2: X0] : ( vAPP(sTfun(X0,$o),$o,vAPP(X0,sTfun(sTfun(X0,$o),$o),'const/sets/IN'(X0),X1),vAPP(sTfun(X0,$o),sTfun(X0,$o),vAPP(X0,sTfun(sTfun(X0,$o),sTfun(X0,$o)),'const/sets/INSERT'(X0),X2),'const/sets/EMPTY'(X0))) != vAPP(X0,$o,vAPP(X0,sTfun(X0,$o),vEQ(X0),X1),X2) ),
inference(ennf_transformation,[],[f7]) ).
thf(f7,plain,
~ ! [X0: $tType,X1: X0,X2: X0] : ( vAPP(sTfun(X0,$o),$o,vAPP(X0,sTfun(sTfun(X0,$o),$o),'const/sets/IN'(X0),X1),vAPP(sTfun(X0,$o),sTfun(X0,$o),vAPP(X0,sTfun(sTfun(X0,$o),sTfun(X0,$o)),'const/sets/INSERT'(X0),X2),'const/sets/EMPTY'(X0))) = vAPP(X0,$o,vAPP(X0,sTfun(X0,$o),vEQ(X0),X1),X2) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,negated_conjecture,
~ ! [X0: $tType,X1: X0,X2: X0] :
( vAPP(sTfun(X0,$o),$o,vAPP(X0,sTfun(sTfun(X0,$o),$o),'const/sets/IN'(X0),X1),vAPP(sTfun(X0,$o),sTfun(X0,$o),vAPP(X0,sTfun(sTfun(X0,$o),sTfun(X0,$o)),'const/sets/INSERT'(X0),X2),'const/sets/EMPTY'(X0)))
= ( X1 = X2 ) ),
inference(negated_conjecture,[],[f3]) ).
thf(f3,conjecture,
! [X0: $tType,X1: X0,X2: X0] :
( vAPP(sTfun(X0,$o),$o,vAPP(X0,sTfun(sTfun(X0,$o),$o),'const/sets/IN'(X0),X1),vAPP(sTfun(X0,$o),sTfun(X0,$o),vAPP(X0,sTfun(sTfun(X0,$o),sTfun(X0,$o)),'const/sets/INSERT'(X0),X2),'const/sets/EMPTY'(X0)))
= ( X1 = X2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','thm/sets/IN_SING_') ).
thf(f22,plain,
! [X0: $tType,X2: X0,X3: X0 > $o,X1: X0] :
( ( vAPP(sTfun(X0,$o),$o,vAPP(X0,sTfun(sTfun(X0,$o),$o),'const/sets/IN'(X0),X1),vAPP(sTfun(X0,$o),sTfun(X0,$o),vAPP(X0,sTfun(sTfun(X0,$o),sTfun(X0,$o)),'const/sets/INSERT'(X0),X2),X3)) = $false )
| ( vAPP(sTfun(X0,$o),$o,vAPP(X0,sTfun(sTfun(X0,$o),$o),'const/sets/IN'(X0),X1),X3) = $true )
| ( X1 = X2 ) ),
inference(equality_proxy_clausification,[],[f21]) ).
thf(f21,plain,
! [X0: $tType,X2: X0,X3: X0 > $o,X1: X0] :
( ( vAPP(sTfun(X0,$o),$o,vAPP(X0,sTfun(sTfun(X0,$o),$o),'const/sets/IN'(X0),X1),vAPP(sTfun(X0,$o),sTfun(X0,$o),vAPP(X0,sTfun(sTfun(X0,$o),sTfun(X0,$o)),'const/sets/INSERT'(X0),X2),X3)) = $false )
| ( vAPP(sTfun(X0,$o),$o,vAPP(X0,sTfun(sTfun(X0,$o),$o),'const/sets/IN'(X0),X1),X3) = $true )
| ( $true = vAPP(X0,$o,vAPP(X0,sTfun(X0,$o),vEQ(X0),X1),X2) ) ),
inference(binary_proxy_clausification,[],[f20]) ).
thf(f20,plain,
! [X0: $tType,X2: X0,X3: X0 > $o,X1: X0] :
( ( vAPP(sTfun(X0,$o),$o,vAPP(X0,sTfun(sTfun(X0,$o),$o),'const/sets/IN'(X0),X1),vAPP(sTfun(X0,$o),sTfun(X0,$o),vAPP(X0,sTfun(sTfun(X0,$o),sTfun(X0,$o)),'const/sets/INSERT'(X0),X2),X3)) = $false )
| ( $true = vAPP($o,$o,vAPP($o,sTfun($o,$o),vOR,vAPP(X0,$o,vAPP(X0,sTfun(X0,$o),vEQ(X0),X1),X2)),vAPP(sTfun(X0,$o),$o,vAPP(X0,sTfun(sTfun(X0,$o),$o),'const/sets/IN'(X0),X1),X3)) ) ),
inference(binary_proxy_clausification,[],[f18]) ).
thf(f30,plain,
( ( sK1 != sK2 )
| ( $false = vAPP(sTfun(sK0,$o),$o,vAPP(sK0,sTfun(sTfun(sK0,$o),$o),'const/sets/IN'(sK0),sK1),vAPP(sTfun(sK0,$o),sTfun(sK0,$o),vAPP(sK0,sTfun(sTfun(sK0,$o),sTfun(sK0,$o)),'const/sets/INSERT'(sK0),sK1),'const/sets/EMPTY'(sK0))) ) ),
inference(inner_rewriting,[],[f28]) ).
thf(f28,plain,
( ( $false = vAPP(sTfun(sK0,$o),$o,vAPP(sK0,sTfun(sTfun(sK0,$o),$o),'const/sets/IN'(sK0),sK1),vAPP(sTfun(sK0,$o),sTfun(sK0,$o),vAPP(sK0,sTfun(sTfun(sK0,$o),sTfun(sK0,$o)),'const/sets/INSERT'(sK0),sK2),'const/sets/EMPTY'(sK0))) )
| ( sK1 != sK2 ) ),
inference(equality_proxy_clausification,[],[f27]) ).
thf(f27,plain,
( ( $false = vAPP(sTfun(sK0,$o),$o,vAPP(sK0,sTfun(sTfun(sK0,$o),$o),'const/sets/IN'(sK0),sK1),vAPP(sTfun(sK0,$o),sTfun(sK0,$o),vAPP(sK0,sTfun(sTfun(sK0,$o),sTfun(sK0,$o)),'const/sets/INSERT'(sK0),sK2),'const/sets/EMPTY'(sK0))) )
| ( $false = vAPP(sK0,$o,vAPP(sK0,sTfun(sK0,$o),vEQ(sK0),sK1),sK2) ) ),
inference(binary_proxy_clausification,[],[f16]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SEV446^1 : TPTP v8.1.2. Released v7.0.0.
% 0.12/0.15 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.16/0.36 % Computer : n023.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Fri May 3 12:13:39 EDT 2024
% 0.16/0.36 % CPUTime :
% 0.16/0.36 % (14528)Running in auto input_syntax mode. Trying TPTP
% 0.16/0.38 % (14531)WARNING: value z3 for option sas not known
% 0.16/0.38 % (14532)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.16/0.38 % (14529)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.16/0.38 % (14530)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.16/0.38 % (14531)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.16/0.38 % (14533)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.16/0.38 % (14534)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.16/0.38 % (14535)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.16/0.38 % Exception at run slice level% Exception at run slice level
% 0.16/0.38 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.16/0.38
% 0.16/0.38 User error: % Exception at run slice level
% 0.16/0.38 User error: Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.16/0.38 Finite model buillding is currently not compatible with polymorphism or higher-order constructs
% 0.16/0.38 % (14535)WARNING: Not using GeneralSplitting currently not compatible with polymorphic/higher-order inputs.
% 0.16/0.39 % (14534)First to succeed.
% 0.16/0.39 % (14534)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-14528"
% 0.16/0.39 % (14531)Also succeeded, but the first one will report.
% 0.16/0.39 % (14534)Refutation found. Thanks to Tanya!
% 0.16/0.39 % SZS status Theorem for theBenchmark
% 0.16/0.39 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.39 % (14534)------------------------------
% 0.16/0.39 % (14534)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.16/0.39 % (14534)Termination reason: Refutation
% 0.16/0.39
% 0.16/0.39 % (14534)Memory used [KB]: 859
% 0.16/0.39 % (14534)Time elapsed: 0.009 s
% 0.16/0.39 % (14534)Instructions burned: 11 (million)
% 0.16/0.39 % (14528)Success in time 0.023 s
%------------------------------------------------------------------------------